منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملSome Results on Super Mean Graphs
Let G be a graph and f : V (G) → {1, 2, 3, . . . , p+ q} be an injection. For each edge e = uv and an integer m ≥ 2, the induced Smarandachely edge m-labeling f∗ S is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, . . . , p+ q}. Particularly, in the case of m = 2, we know that f ∗(e) = f(u)+f(v) ...
متن کاملSome More Inequalities for Arithmetic Mean, Harmonic Mean and Variance
We derive bounds on the variance of a random variable in terms of its arithmetic and harmonic means. Both discrete and continuous cases are considered, and an operator version is obtained. Some refinements of the Kantorovich inequality are obtained. Bounds for the largest and smallest eigenvalues of a positive definite matrix are also obtained.
متن کاملfurther results on odd mean labeling of some subdivision graphs
let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...
متن کاملFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2012
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v4n1p21